An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs
نویسندگان
چکیده
A mixed dominating set S of a graph G = (V,E) is a subset S ⊆ V ∪ E such that each element v ∈ (V ∪ E) \ S is adjacent or incident to at least one element in S. The mixed domination number γm(G) of a graph G is the minimum cardinality among all mixed dominating sets in G. The problem of finding γm(G) is know to be NP-complete. In this paper, we present an explicit polynomial-time algorithm to construct a mixed dominating set of size γm(G) by a parse tree when G is a generalized series-parallel graph.
منابع مشابه
Perfect edge domination and efficient edge domination in graphs
Let G = (V; E) be a /nite and undirected graph without loops and multiple edges. An edge is said to dominate itself and any edge adjacent to it. A subset D of E is called a perfect edge dominating set if every edge of E \ D is dominated by exactly one edge in D and an e cient edge dominating set if every edge of E is dominated by exactly one edge in D. The perfect (e cient) edge domination prob...
متن کاملBroadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees
Broadcast domination assigns an integer value f(u) 0 to each vertex u of a given graph, such that every vertex u with f(u) = 0 is within distance f(v) from a vertex v with f(v) > 0. We can regard the vertices v with f(v) > 0 as broadcast stations, each having a transmission power that might be di erent from the powers of other stations. The optimal broadcast domination problem seeks to minimize...
متن کاملA Linear Algorithm for Computing $\gamma_{[1,2]}$-set in Generalized Series-Parallel Graphs
For a graph G = (V,E), a set S ⊆ V is a [1, 2]-set if it is a dominating set for G and each vertex v ∈ V \S is dominated by at most two vertices of S, i.e. 1 ≤ |N(v)∩S| ≤ 2. Moreover a set S ⊆ V is a total [1, 2]-set if for each vertex of V , it is the case that 1 ≤ |N(v)∩S| ≤ 2. The [1, 2]-domination number of G, denoted γ[1,2](G), is the minimum number of vertices in a [1, 2]-set. Every [1, 2...
متن کاملA Linear Algorithm for Computing γ[1,2]-set in Generalized Series-Parallel Graphs
For a graph G = (V,E), a set S ⊆ V is a [1, 2]-set if it is a dominating set for G and each vertex v ∈ V \S is dominated by at most two vertices of S, i.e. 1 ≤ |N(v)∩S| ≤ 2. Moreover a set S ⊆ V is a total [1, 2]-set if for each vertex of V , it is the case that 1 ≤ |N(v)∩S| ≤ 2. The [1, 2]-domination number of G, denoted γ[1,2](G), is the minimum number of vertices in a [1, 2]-set. Every [1, 2...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1708.00240 شماره
صفحات -
تاریخ انتشار 2017